1-D random landscapes and non-random data series
نویسندگان
چکیده
منابع مشابه
1-D random landscapes and non-random data series
We study the simplest random landscape, the curve formed by joining consecutive data points f1, . . . , fN+1 with line segments, where the fi are i.i.d. random numbers and fi = fj . We label each segment increasing (+) or decreasing (−) and call this string of +’s and −’s the up-down signature σ. We calculate the probability P (σ(f)) for a random curve and use it to bound the algorithmic inform...
متن کاملEnergy Landscapes of Multidimensional Random Fourier Series
To any positive number ε and any nonnegative even Schwartz function w : R → R we associate the random function u on them-torus T := R/Z defined as the real part of the random Fourier series ∑ ~ν∈Zm X~ν,ε exp(2πi~ν · ~ θ), whereX~ν,ε are complex independent Gaussian random variables with variancew(ε|~ν|). LetN denote the number of critical points of u. We describe explicitly two constantsC,C′ su...
متن کاملAddress reduction blindly identifies non-random data series
We introduce a method of detecting data series (curves) which exhibit pattern without knowing what kind of pattern they contain. By partitioning the space of curves into neighbourhoods, we show that the curves with the shortest addresses are the most likely to result from simple underlying mechanisms. We show that address reduction is a bound on Kolmogorov complexity and is invariant over noise...
متن کاملRandom Walks in Routing Landscapes
In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how they can help us on the evaluation of the problem difficulty and the generation of effective algorithms. We also present the random walk statistical technique ...
متن کاملRandom Walks in Routing Landscapes
In this paper we present a combinatorial optimisation view on the routing problem for connectionless packet networks by using the metaphor of a landscape. We examine the main properties of the routing landscapes as we define them and how they can help us on the evaluation of the problem difficulty and the generation of effective algorithms. We also present the random walk statistical technique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Europhysics Letters (EPL)
سال: 2007
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/79/38006